#pragma once
#include "RBTree_Set_Map.h"
namespace bit
{
	template<class K>
	class set
	{
		struct Oft
		{
			const K& operator()(const K& data)
			{
				return data;
			}
		};
	public:
		typedef typename RBTreeNode<const K> Node;
		typedef typename RBTree<K, const K, Oft>::iterator iterator;
		typedef typename RBTree<K, const K, Oft>::const_iterator const_iterator;
		

		
		pair<iterator, bool> insert(const K& data)
		{
			return _s.Insert(data);
		}
	private:
		RBTree<K, const K, Oft> _s;
	};
	void SetTest()
	{
		set<int> s;
		int a[] = { 4, 2, 6, 1, 3, 5, 15, 7, 16, 14 };
		for (auto e : a)
		{
			s.insert(e);
		}
		
		
		
	}
}